Prioritise the Best Variation

Binary session types guarantee communication safety and fidelity, but alone they cannot rule out deadlocks arising from the interleaving of different sessions. In Classical Processes (CP) [53]—a process calculus based on classical linear logic—deadlock freedom is guaranteed by combining channel creation parallel composition under same logical cut rule. Similarly, in Good Variation (GV) [39, 54]—a concurrent $$\lambda $$ -calculus—deadlock thread spawning operation, called fork. both CP GV, deadlock achieved at expense expressivity, as only processes allowed are tree-structured. Dardha Gay [19] define Priority (PCP), which allows cyclic-structured restores using priorities, line with Kobayashi Padovani [34, 44]. Following PCP, we present GV (PGV), a variant decouples spawning. Consequently, type restore priorities. We show that our system sound proving subject reduction progress. an encoding PCP to PGV prove preserves typing complete respect operational semantics.